Low space data structures for geometric range mode query
نویسندگان
چکیده
منابع مشابه
Low Space Data Structures for Geometric Range Mode Query
Let S be a set of n points in an [n] grid, such that each point is assigned a color. Given a query range Q = [a1, b1] × [a2, b2] × . . . × [ad, bd], the geometric range mode query problem asks to report the most frequent color (i.e., a mode) of the multiset of colors corresponding to points in S ∩ Q. When d = 1, Chan et al. (STACS 2012 [2]) gave a data structure that requires O(n + (n/∆)/w) wor...
متن کاملData Structures for Reporting Extension Violations in a Query Range
Design Rule Checking (DRC) in VLSI design involves checking if a given VLSI layout satisfies a given set of rules, and reporting the violations if any. We propose data structures for reporting violations of the minimum extension rule in a query window of
متن کاملSpace Efficient Data Structures for Dynamic Orthogonal Range Counting
We present a linear-space data structure that maintains a dynamic set of n points with coordinates of real numbers on the plane to support orthogonal range counting, as well as insertions and deletions, in O(( lgn lg lgn )) time. This provides faster support for updates than previous results with the same bounds on space cost and query time. We also obtain two other new results by considering t...
متن کاملRange aggregate structures for colored geometric objects
A set of n colored objects (points/hyperboxes) lie in IR and given a query orthogonal range q, we need to report the distinct colors of the objects in S ∩ q. In a scenarto where these colored objects also come associated with a weight, for each distinct color c of the objects in S ∩ q, the tuple < c, F(c) > where F(c) is the object of color c with the maximum weight is reported.
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.03.011